On Anaphora and the Binding Principles in Categorial Grammar

نویسندگان

  • Glyn Morrill
  • Oriol Valentín
چکیده

In type logical categorial grammar the analysis of an expression is a resource-conscious proof. Anaphora represents a particular challenge to this approach in that the antecedent resource is multiplied in the semantics. This duplication, which corresponds logically to the structural rule of contraction, may be treated lexically or syntactically. Furthermore, anaphora is subject to constraints, which Chomsky (1981)[1] formulated as Binding Principles A, B, and C. In this paper we consider English anaphora in categorial grammar including reference to the binding principles. We invoke displacement calculus, modal categorial calculus, categorial calculus with limited contraction, and entertain addition of negation

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Binding Domains: Anaphoric and Pronominal Pronouns in Categorial Grammar

In this paper we present a treatment for anaphoric pronouns and reflexives in a Type Logical Grammar. To this end, we introduce structural modalities into the left pronominal rule of the categorial calculus with limited contraction LLC [8]. Following a proposal due to Hepple [6], we also sketch an analysis for the long-distance anaphora seg from Icelandic.

متن کامل

Anaphora and Quantification in Categorial Grammar

The paper proposes a type logical reformulation of Jacobson’s ([9]) treatment of anaphoric dependencies in Categorial Grammar. To this end, the associative Lambek Calculus is extended with a new connective. In the first part, its proof theory is introduced and the logical properties of the resulting calculus are discussed. In the second part, this system is applied to several linguistic phenome...

متن کامل

Type-logical Anaphora

We present a type-logical account of anaphora. The principal means is the introduction of type-constructors for`secondary wrap': wrap around the second of two split points in a discontinuous string. We illustrate in terms of preevaluated proof nets, proof nets in which lexico-syntactic interaction is computed in a lexical compilation rather than at the stage of derivation. We suggest that the a...

متن کامل

A platform for collaborative semantic annotation

Data-driven approaches in computational semantics are not common because there are only few semantically annotated resources available. We are building a large corpus of public-domain English texts and annotate them semi-automatically with syntactic structures (derivations in Combinatory Categorial Grammar) and semantic representations (Discourse Representation Structures), including events, th...

متن کامل

Incremental Centering and Center Ambiguity

of verbs in Japanese, given that the number of candidate antecedents exceeds that of the zero anaphors. Their use of functional notions, viz. topicality and empathy, naturally extend the role preferences of the underlying centering model, but unlike our case, no structural ambiguities are involved. In contrast, our approach applies to the representation of both types of ambiguities. We motivate...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010